0.00/0.09	% Problem    : Vampire---4.8_12785 : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : run_E %s %d THM
0.09/0.30	% Computer : n020.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1440
0.09/0.30	% WCLimit    : 180
0.09/0.30	% DateTime   : Mon Jul  3 12:54:01 EDT 2023
0.09/0.30	% CPUTime    : 
0.15/0.40	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.qlt4fDnWXa/Vampire---4.8_12785
0.15/0.40	# Version: 3.1pre001-ho
0.15/0.42	# Preprocessing class: HSMSSMSSSSSNSSA.
0.15/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.15/0.42	# Starting post_as_ho1 with 900s (5) cores
0.15/0.42	# Starting post_as_ho12 with 180s (1) cores
0.15/0.42	# Starting new_ho_3 with 180s (1) cores
0.15/0.42	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.15/0.42	# post_as_ho12 with pid 12972 completed with status 0
0.15/0.42	# Result found by post_as_ho12
0.15/0.42	# Preprocessing class: HSMSSMSSSSSNSSA.
0.15/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.15/0.42	# Starting post_as_ho1 with 900s (5) cores
0.15/0.42	# Starting post_as_ho12 with 180s (1) cores
0.15/0.42	# No SInE strategy applied
0.15/0.42	# Search class: HGUSF-FFSF21-SSSFFSBN
0.15/0.42	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.15/0.42	# Starting post_as_ho12 with 109s (1) cores
0.15/0.42	# post_as_ho12 with pid 12976 completed with status 0
0.15/0.42	# Result found by post_as_ho12
0.15/0.42	# Preprocessing class: HSMSSMSSSSSNSSA.
0.15/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.15/0.42	# Starting post_as_ho1 with 900s (5) cores
0.15/0.42	# Starting post_as_ho12 with 180s (1) cores
0.15/0.42	# No SInE strategy applied
0.15/0.42	# Search class: HGUSF-FFSF21-SSSFFSBN
0.15/0.42	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.15/0.42	# Starting post_as_ho12 with 109s (1) cores
0.15/0.42	# Preprocessing time       : 0.001 s
0.15/0.42	# Presaturation interreduction done
0.15/0.42	
0.15/0.42	# Proof found!
0.15/0.42	# SZS status Theorem
0.15/0.42	# SZS output start CNFRefutation
0.15/0.42	thf(decl_22, type, x: iS).
0.15/0.42	thf(decl_23, type, cP: iS > iS > iS).
0.15/0.42	thf(decl_24, type, c0: iS).
0.15/0.42	thf(decl_25, type, esk1_1: (iS > $o) > iS).
0.15/0.42	thf(decl_26, type, esk2_1: (iS > $o) > iS).
0.15/0.42	thf(decl_27, type, epred1_0: iS > iS > iS > $o).
0.15/0.42	thf(cS_INCL_LEM3_pme, conjecture, (((![X1:iS > $o]:((((X1 @ c0)&![X2:iS, X3:iS]:((((X1 @ X2)&(X1 @ X3))=>(X1 @ (cP @ X2 @ X3)))))=>![X2:iS]:((X1 @ X2))))&![X2:iS, X3:iS, X4:iS, X5:iS]:(((((X4)=(X5))&((X2)=(X3)))<=((cP @ X2 @ X4)=(cP @ X3 @ X5)))))&![X2:iS, X3:iS]:(((cP @ X2 @ X3)!=(c0))))=>![X6:iS > iS > iS > $o]:(((($true)&![X7:iS, X8:iS, X9:iS]:((((((X8)=(X9))&((X7)=(c0)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&((X8)=(cP @ X12 @ X13)))&((X9)=(cP @ X14 @ X15)))&(X6 @ X10 @ X12 @ X14))&(X6 @ X11 @ X13 @ X15)))|(((X8)=(c0))&((X7)=(X9))))=>(X6 @ X7 @ X8 @ X9))))=>(X6 @ x @ x @ x)))), file('/export/starexec/sandbox/tmp/tmp.qlt4fDnWXa/Vampire---4.8_12785', cS_INCL_LEM3_pme)).
0.15/0.42	thf(c_0_1, negated_conjecture, ~((((![X1:iS > $o]:((((X1 @ c0)&![X2:iS, X3:iS]:((((X1 @ X2)&(X1 @ X3))=>(X1 @ (cP @ X2 @ X3)))))=>![X2:iS]:((X1 @ X2))))&![X2:iS, X3:iS, X4:iS, X5:iS]:((((cP @ X2 @ X4)=(cP @ X3 @ X5))=>(((X4)=(X5))&((X2)=(X3))))))&![X2:iS, X3:iS]:(((cP @ X2 @ X3)!=(c0))))=>![X6:iS > iS > iS > $o]:((![X7:iS, X8:iS, X9:iS]:((((((X8)=(X9))&((X7)=(c0)))|?[X10:iS, X11:iS, X12:iS, X13:iS, X14:iS, X15:iS]:(((((((X7)=(cP @ X10 @ X11))&((X8)=(cP @ X12 @ X13)))&((X9)=(cP @ X14 @ X15)))&(X6 @ X10 @ X12 @ X14))&(X6 @ X11 @ X13 @ X15)))|(((X8)=(c0))&((X7)=(X9))))=>(X6 @ X7 @ X8 @ X9)))=>(X6 @ x @ x @ x))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM3_pme])])).
0.15/0.42	thf(c_0_2, negated_conjecture, ![X36:iS > $o, X39:iS, X40:iS, X41:iS, X42:iS, X43:iS, X44:iS, X45:iS, X47:iS, X48:iS, X49:iS, X50:iS, X51:iS, X52:iS, X53:iS, X54:iS, X55:iS]:((((((((X36 @ (esk1_1 @ X36))|~(X36 @ c0)|(X36 @ X39))&((X36 @ (esk2_1 @ X36))|~(X36 @ c0)|(X36 @ X39)))&(~(X36 @ (cP @ (esk1_1 @ X36) @ (esk2_1 @ X36)))|~(X36 @ c0)|(X36 @ X39)))&((((X42)=(X43))|((cP @ X40 @ X42)!=(cP @ X41 @ X43)))&(((X40)=(X41))|((cP @ X40 @ X42)!=(cP @ X41 @ X43)))))&((cP @ X44 @ X45)!=(c0)))&((((((X48)!=(X49))|((X47)!=(c0))|(epred1_0 @ X47 @ X48 @ X49))&(((X47)!=(cP @ X50 @ X51))|((X48)!=(cP @ X52 @ X53))|((X49)!=(cP @ X54 @ X55))|~(epred1_0 @ X50 @ X52 @ X54)|~(epred1_0 @ X51 @ X53 @ X55)|(epred1_0 @ X47 @ X48 @ X49)))&(((X48)!=(c0))|((X47)!=(X49))|(epred1_0 @ X47 @ X48 @ X49)))&~(epred1_0 @ x @ x @ x)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.15/0.42	thf(c_0_3, negated_conjecture, ![X2:iS, X3:iS, X4:iS]:(((epred1_0 @ X4 @ X2 @ X3)|((X2)!=(X3))|((X4)!=(c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_4, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ (esk2_1 @ X1))|(X1 @ X2)|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_5, negated_conjecture, ![X2:iS]:((epred1_0 @ c0 @ X2 @ X2)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_3])])).
0.15/0.42	thf(c_0_6, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ (esk1_1 @ X1))|(X1 @ X2)|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_7, negated_conjecture, ![X7:iS, X2:iS, X3:iS, X5:iS, X4:iS, X9:iS, X8:iS, X10:iS, X11:iS]:(((epred1_0 @ X2 @ X5 @ X9)|((X2)!=(cP @ X3 @ X4))|((X5)!=(cP @ X7 @ X8))|((X9)!=(cP @ X10 @ X11))|~((epred1_0 @ X3 @ X7 @ X10))|~((epred1_0 @ X4 @ X8 @ X11)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_8, negated_conjecture, ![X2:iS, X3:iS, X4:iS]:(((epred1_0 @ X3 @ X2 @ X4)|((X2)!=(c0))|((X3)!=(X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_9, negated_conjecture, ![X2:iS]:(((epred1_0 @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X2 @ X2 @ X2))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
0.15/0.42	thf(c_0_10, negated_conjecture, ![X2:iS]:(((epred1_0 @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))))|(epred1_0 @ X2 @ X2 @ X2))), inference(spm,[status(thm)],[c_0_6, c_0_5])).
0.15/0.42	thf(c_0_11, negated_conjecture, ![X2:iS, X1:iS > $o]:(((X1 @ X2)|~((X1 @ (cP @ (esk1_1 @ X1) @ (esk2_1 @ X1))))|~((X1 @ c0)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_12, negated_conjecture, ![X3:iS, X8:iS, X5:iS, X4:iS, X2:iS, X7:iS]:(((epred1_0 @ (cP @ X2 @ X3) @ (cP @ X4 @ X5) @ (cP @ X7 @ X8))|~((epred1_0 @ X3 @ X5 @ X8))|~((epred1_0 @ X2 @ X4 @ X7)))), inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_7])])])).
0.15/0.42	thf(c_0_13, negated_conjecture, ![X2:iS]:((epred1_0 @ X2 @ c0 @ X2)), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_8])])).
0.15/0.42	thf(c_0_14, negated_conjecture, (epred1_0 @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk2_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_9])).
0.15/0.42	thf(c_0_15, negated_conjecture, (epred1_0 @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0)))) @ (esk1_1 @ (^[Z0/* 3 */:iS]:((epred1_0 @ Z0 @ Z0 @ Z0))))), inference(ef,[status(thm)],[c_0_10])).
0.15/0.42	thf(c_0_16, negated_conjecture, ~((epred1_0 @ x @ x @ x)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.15/0.42	thf(c_0_17, negated_conjecture, ![X2:iS]:((epred1_0 @ X2 @ X2 @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), c_0_14]), c_0_15])])).
0.15/0.42	thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])]), ['proof']).
0.15/0.42	# SZS output end CNFRefutation
0.15/0.42	# Parsed axioms                        : 5
0.15/0.42	# Removed by relevancy pruning/SinE    : 0
0.15/0.42	# Initial clauses                      : 14
0.15/0.42	# Removed in clause preprocessing      : 4
0.15/0.42	# Initial clauses in saturation        : 10
0.15/0.42	# Processed clauses                    : 68
0.15/0.42	# ...of these trivial                  : 5
0.15/0.42	# ...subsumed                          : 13
0.15/0.42	# ...remaining for further processing  : 50
0.15/0.42	# Other redundant clauses eliminated   : 43
0.15/0.42	# Clauses deleted for lack of memory   : 0
0.15/0.42	# Backward-subsumed                    : 10
0.15/0.42	# Backward-rewritten                   : 3
0.15/0.42	# Generated clauses                    : 323
0.15/0.42	# ...of the previous two non-redundant : 233
0.15/0.42	# ...aggressively subsumed             : 0
0.15/0.42	# Contextual simplify-reflections      : 0
0.15/0.42	# Paramodulations                      : 218
0.15/0.42	# Factorizations                       : 24
0.15/0.42	# NegExts                              : 0
0.15/0.42	# Equation resolutions                 : 70
0.15/0.42	# Total rewrite steps                  : 39
0.15/0.42	# Propositional unsat checks           : 0
0.15/0.42	#    Propositional check models        : 0
0.15/0.42	#    Propositional check unsatisfiable : 0
0.15/0.42	#    Propositional clauses             : 0
0.15/0.42	#    Propositional clauses after purity: 0
0.15/0.42	#    Propositional unsat core size     : 0
0.15/0.42	#    Propositional preprocessing time  : 0.000
0.15/0.42	#    Propositional encoding time       : 0.000
0.15/0.42	#    Propositional solver time         : 0.000
0.15/0.42	#    Success case prop preproc time    : 0.000
0.15/0.42	#    Success case prop encoding time   : 0.000
0.15/0.42	#    Success case prop solver time     : 0.000
0.15/0.42	# Current number of processed clauses  : 24
0.15/0.42	#    Positive orientable unit clauses  : 11
0.15/0.42	#    Positive unorientable unit clauses: 0
0.15/0.42	#    Negative unit clauses             : 1
0.15/0.42	#    Non-unit-clauses                  : 12
0.15/0.42	# Current number of unprocessed clauses: 38
0.15/0.42	# ...number of literals in the above   : 114
0.15/0.42	# Current number of archived formulas  : 0
0.15/0.42	# Current number of archived clauses   : 23
0.15/0.42	# Clause-clause subsumption calls (NU) : 55
0.15/0.42	# Rec. Clause-clause subsumption calls : 40
0.15/0.42	# Non-unit clause-clause subsumptions  : 4
0.15/0.42	# Unit Clause-clause subsumption calls : 15
0.15/0.42	# Rewrite failures with RHS unbound    : 0
0.15/0.42	# BW rewrite match attempts            : 22
0.15/0.42	# BW rewrite match successes           : 13
0.15/0.42	# Condensation attempts                : 0
0.15/0.42	# Condensation successes               : 0
0.15/0.42	# Termbank termtop insertions          : 21581
0.15/0.42	
0.15/0.42	# -------------------------------------------------
0.15/0.42	# User time                : 0.016 s
0.15/0.42	# System time              : 0.001 s
0.15/0.42	# Total time               : 0.017 s
0.15/0.42	# Maximum resident set size: 1728 pages
0.15/0.42	
0.15/0.42	# -------------------------------------------------
0.15/0.42	# User time                : 0.017 s
0.15/0.42	# System time              : 0.002 s
0.15/0.42	# Total time               : 0.019 s
0.15/0.42	# Maximum resident set size: 1740 pages
0.15/0.42	% E---3.1 exiting
0.15/0.42	EOF